Long-Term Prediction of Creep Strain of Expanded Polystyrene

Data obtained in investigating the creep of expanded polystyrene in compression are discussed. An analysis of the results of creep tests 65–608 days long showed that the creep can be predicted for 50 years based on experiments of less duration than the 605 days indicated in EN 13163. For this purpose, it is suggested to employ a 95-fold extrapolation in time if the creep curves are described by a power function (as recommended by EN 13163) or a 50-fold extrapolation if the exponential equation proposed in the present paper is used. __________ Translated from Mekhanika Kompozitnykh Materialov, Vol. 41, No. 6, pp. 795–802, November–December, 2005.     

Determination of the rheological behavior of epoxy–amine thermosets by dynamic mechanical analysis: Isothermal methods versus nonisothermal methods

The reticulation process of an epoxy resin using an amine as a cure agent was studied at different temperatures and concentrations of the cure agent with dynamic mechanical thermal analysis. The study was performed under both isothermal and nonisothermal conditions, and a temperature–time–transformation diagram was obtained. The measurements from the two modes gave similar results, although the nonisothermal mode required fewer experiments. © 2003 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 41: 1965–1977, 2003     

SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES AND COMPRESSION COSTS （PART I：EQUAL TIMES AND COSTS）

Most papers in scheduling research have treated individual job processing times as fixed parameters. However, in many practical situations, a manager may control processing time by realloeating resources. In this paper, authors consider a machine scheduling problemwith controllable processing times. In the first part of this paper, a special case where the pro-cessing times and compression costs are uniform among jobs is discussed. Theoretical results are derived that aid in developing an O（n^2) algorithm to slove the problem optimally. In the second part of this paper, authors generalize the discussion to general case, An effective heuristic to the genera/ problem will be presented.     

Use of dynamic trees in a network simplex algorithm for the maximum flow problem

Goldfarb and Hao (1990) have proposed a pivot rule for the primal network simplex algorithm that will solve a maximum flow problem on ann-vertex,m-arc network in at mostnm pivots and O(n ² m) time. In this paper we describe how to extend the dynamic tree data structure of Sleator and Tarjan (1983, 1985) to reduce the running time of this algorithm to O(nm logn). This bound is less than a logarithmic factor larger than those of the fastest known algorithms for the problem. Our extension of dynamic trees is interesting in its own right and may well have additional applications.Research partially supported by a Presidential Young Investigator Award from the National Science Foundation, Grant No. CCR-8858097, an IBM Faculty Development Award, and AT&T Bell Laboratories.Research partially supported by the Office of Naval Research, Contract No. N00014-87-K-0467.Research partially supported by the National Science Foundation, Grant No. DCR-8605961, and the Office of Naval Research, Contract No. N00014-87-K-0467.     

Convergence analysis of time-point relaxation iterates for linear systems of differential equations

We study convergence properties of time-point relaxation (TR) Runge-Kutta methods for linear systems of ordinary differential equations. TR methods are implemented by decoupling systems in Gauss-Jacobi, Gauss-Seidel and successive overrelaxation modes (continuous-time iterations) and then solving the resulting subsystems by means of continuous extensions of Runge-Kutta (CRK) methods (discretized iterations). By iterating to convergence, these methods tend to the same limit called diagonally split Runge-Kutta (DSRK) method. We prove that TR methods are equivalent to decouple in the same modes the linear algebraic system obtained by applying DSRK limit method. This issue allows us to study the convergence of TR methods by using standard principles of convergence of iterative methods for linear algebraic systems. For a particular problem regions of convergence are plotted.     

Ionic nanocomposites based on XNBR-OMg filled with layered nanoclays

Ionic elastomers based on carboxylated nitrile rubber (XNBR) crosslinked with magnesium oxide (OMg) and filled with layered nanoclays have been prepared. Two types of nanofillers were employed: a commercial one (Cloisite 15 A) and the other prepared in our laboratory (BCA-ODA). The properties of raw and vulcanized compounds have been studied in order to elucidate the effect of layered nanoclays. X-ray diffraction analysis shows that during compounding and crosslinking the macromolecular chains of rubber were intercalated in a commercial nanofiller, whilst our nanoclay was exfoliated. However, this fact does not affect the properties of compounds homogeneously. Vulcanization parameters, Mooney viscosity and decay and rheological properties were affected depending on the filler type. Mechanical properties were not significantly varied, but glass transition temperature and ionic transition temperature were shifted in comparison with those of the unfilled compound.     

重力输水管道优化设计方法研究

针对重力输水管道设计中存在的问题，文章以管道造价最小为目标，应用动态规划，提出了一种新的重力输水管道优化设计方法，对输水管的当量管径、流量分配、连接管设置与可靠性校核计算等问题作了探讨。该方法可用于沿线有节点流量流出的并联输水管道优化设计，能明显节省投资，有良好的实用性     

基于专家动态权重的群组AHP交互式决策方法

为了能在群组决策中得到更为客观和准确的决策结果,在把专家权重划分为静态权重和动态权重的基础上,研究了在交互式决策中专家动态权重的确定方法,给出了共识度的一个定义.在此基础上,研究了群组AHP交互式决策方法中的一致性和相容性检验,给出了基于专家动态权重的群组AHP交互式决策方法流程,最后用一个示例说明了该方法的应用步骤.     

Guaranteed-accuracy approximation of reachable sets for a linear dynamic system subject to impulse actions

A method is proposed for approximating the reachable set of a dynamic system with a state space dimension no higher than six-eight considered on a finite time interval. The system is governed by linear differential equations with piecewise constant coefficients and impulse actions specified at prescribed times. The method is based on guaranteed-accuracy polyhedral approximations of reachable sets at researcher-specified times. Every approximation is constructed using the preceding one. A procedure is described for choosing parameters of the method that ensure the required accuracy with close-to-minimal time costs.     

航线优化的随机动态规划模型

航空公司在给定的运力和机队配置条件下,如何适应航线需求的不断变化而合理地分配运力,使航空公司的经营效益最大化是我国航空经营管理的一个重大课题.根据航班效益分析,在一定的经营时间,航行班次的条件下,建立一个航线贡献最大化的含有随机变量的动态规划模型.求解方法是先用M ON TE C ARLO方法计算机仿真把模型转化为非线性的整数规划.再用动态规划中资源分配算法求出模型的最优解,编排最优各航线规划.